The orthogonal Procrustes problem [1] is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices and and asked to find an orthogonal matrix which most closely maps to . [2] Specifically,
where denotes the Frobenius norm.
The name Procrustes refers to a bandit from Greek mythology who made his victims fit his bed either by stretching their limbs or cutting them off.
Contents |
This problem was originally solved by Peter Schonemann in a 1964 thesis. The individual solution was later published. [3]
This problem is equivalent to finding the nearest orthogonal matrix to a given matrix . To find this orthogonal matrix , one uses the singular value decomposition
to write
There are a number of related problems to the classical orthogonal Procrustes problem. One might generalize it by seeking the closest matrix in which the columns are orthogonal, but not necessarily orthonormal. [4]
Alternately, one might constrain it by only allowing rotation matrices (i.e. orthogonal matrices with determinant 1, also known as special orthogonal matrices). In this case, one can write (using the above decomposition )
where is a modified , with the smallest singular value replaced by (+1 or -1), and the other singular values replaced by 1, so that the determinant of R is guaranteed to be positive.[5]